Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

Asymptotic Analysis of Plausible Tree Hash Modes for SHA-3

Discussions about the choice of a tree hash mode of operation for a standardization have recently been undertaken. It appears that a single tree mode cannot address adequately all possible uses and specifications of a system. In this paper, we review the tree modes which have been proposed, we discuss their problems and propose solutions. We make the reasonable assumption that communicating sys...

On Plausible Tree Hash Modes for SHA-3

Discussions are currently underway about the choice of a tree hash mode of operation for a standardization. It appears that a single tree mode cannot address the specificities of all possible uses and specifications of a system. In this paper, we review the tree modes which have been proposed, we discuss their problems and propose remedies. We make the reasonnable assumption that communicating ...

Relaxed Differential Fault Analysis of SHA-3

In this paper, we propose a new method of differential fault analysis of SHA-3 which is based on the differential relations of the algorithm. Employing those differential relations in the fault analysis of SHA-3 gives new features to the proposed attacks, e.g., the high probability of fault detection and the possibility of re-checking initial faults and the possibility to recover internal state...

SHA-3: The BLAKE Hash Function

A global competition is currently taking place to select a hash function which will become a new standard in the field of cryptography. The competition was announced in 2007 by the National Institute of Standards and Technology (NIST) to find a successor to its previous Secure Hash Algorithm (SHA) standards, SHA-1 and SHA-2. The submissions have been narrowed down to a set of five, judged by th...

SHA - 3 and The Hash Function